ALLSAT compressed with wildcards. Part 2: All k-models of a BDD

Throughout φ : {0, 1}n → {0, 1} denotes a Boolean function. In Section 2 we review the standard methods for calculating the cardinality of the model set Mod(φ) from a BDD of φ, respectively for enumerating (= generating) the whole of Mod(φ) in compressed form. Here “compressed” means using the don’t-care symbol “2” which e.g. in (1, 1, 2, 0, 1) signifies that both bitstrings (1, 1, 0, 0, 1) and (1, 1, 1, 0, 1) are allowed.